94. Binary Tree Inorder Traversal - LeetCode Solution

Stack Tree Binary tree

Python

Python Code:

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
        ans = []
        
        def trav(root):
            if not root:
                return
            
            
            trav(root.left)
            ans.append(root.val)
            trav(root.right)
        trav(root)
        return ans

Comments

Submit

0 Comments

More Questions

238. Product of Array Except Self	229. Majority Element II
222. Count Complete Tree Nodes	215. Kth Largest Element in an Array
198. House Robber	153. Find Minimum in Rotated Sorted Array
150. Evaluate Reverse Polish Notation	144. Binary Tree Preorder Traversal
137. Single Number II	130. Surrounded Regions
129. Sum Root to Leaf Numbers	120. Triangle
102. Binary Tree Level Order Traversal	96. Unique Binary Search Trees
75. Sort Colors	74. Search a 2D Matrix
71. Simplify Path	62. Unique Paths
50. Pow(x, n)	43. Multiply Strings
34. Find First and Last Position of Element in Sorted Array	33. Search in Rotated Sorted Array
17. Letter Combinations of a Phone Number	5. Longest Palindromic Substring
3. Longest Substring Without Repeating Characters	1312. Minimum Insertion Steps to Make a String Palindrome
1092. Shortest Common Supersequence	1044. Longest Duplicate Substring
1032. Stream of Characters	987. Vertical Order Traversal of a Binary Tree